منابع مشابه
Spatial mixing and the connective constant: Optimal bounds
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model (which is defined as a weighted sum over all matchings where each matching is given a weight γ|V |−2|M| in terms of a fixed parameter γ called the monomer ac...
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملComputable Optimal Value Bounds for Generalized Convex Programs
It has been shown by Fiacco that convexity or concavity of the optimal value of a parametric nonlinear programming problem can readily be exploited to calculate global parametric upper and lower bounds on the optimal value function. The approach is attractive because it involves manipulation of information normally required to characterize solution optimality. We briefly describe a procedure fo...
متن کاملUpper Bounds for Constant - Weight
| Let A(n; d; w) denote the maximum possible number of codewords in an (n; d; w) constant-weight binary code. We improve upon the best known upper bounds on A(n; d; w) in numerous instances for n 6 24 and d 6 10, which is the parameter range of existing tables. Most improvements occur for d = 8; 10, where we reduce the upper bounds in more than half of the unresolved cases. We also extend the e...
متن کاملLower Bounds for the Disk Packing Constant
An osculatory packing of a disk, U, is an infinite sequence of disjoint disks, ¡ U„ \, contained in U, chosen so that, for n S 2, (/» has the largest possible radius, r„, of all disks fitting in U\(Ui \J ••• KJ i/„_i). The exponent of the packing, S, is the least upper bound of numbers, t, such that 2Z r\, = <*>. Here, we present a number of methods for obtaining lower bounds for S, based on ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2018
ISSN: 1029-242X
DOI: 10.1186/s13660-018-1711-1